منابع مشابه
The Limits of Fixed-Order Computation
Fixed-order computation rules, used by Prolog and most deductive database systems, do not suuce to compute the well-founded semantics 29] because they cannot properly resolve loops through negation. This inadequacy is reeected both in formulations of SLS-resolution 17, 23] which is an ideal search strategy, and in more practical strategies like SLG 5], or Well-Founded Ordered Search 27]. Typica...
متن کاملThe Limits of Fixed - Order ComputationDraftKonstantinos
Fixed-order computation rules, such as used by Prolog and deductive database systems such as CORAL, do not suuce to compute the well-founded semantics because they cannot properly resolve loops through negation. This inadequacy has been acknowledged not only in formulations of SLS resolution 6, 9] which is an ideal search strategy, but in more practical strategies 2, 13]. The practical strategi...
متن کاملThe limits of !xed-order computation
Fixed-order computation rules, used by Prolog and most deductive database systems, do not su5ce to compute the well-founded semantics (Van Gelder et al., J. ACM 38(3) (1991) 620– 650) because they cannot properly resolve loops through negation. This inadequacy is re:ected both in formulations of SLS-resolution (Przymusinski, in: Proc. 8th ACM SIGACT-SIGMODSIGART Symp. on Principles of Database ...
متن کاملOn the fixed point of order 2
This paper deals with a new type of fixed point, i.e;"fixed point of order 2" which is introduced in a metric spaceand some results are achieved.
متن کاملTime-fixed geometry of 2nd order ODEs
Abstract : Let be a 2nd order ODE. By Cartan equivalence method, we will study the local equivalence problem under the transformations group of time-fixed coordinates. We are going to solve this problem by an applicable method which has been recognized by R. Gardner, and classify them.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00341-2